Dijkstra-Scholten predicate calculus: concepts and misconceptions
نویسندگان
چکیده
منابع مشابه
Induction of Concepts in the Predicate Calculus
P o s i t i v e and n e g a t i v e i ns tances of a concept are assumed to be desc r i bed by a c o n j u n c t i o n o f l i t e r a l s i n the p r e d i c a t e c a l c u l u s , w i t h terms l i m i t e d t o cons tan ts and u n i v e r s a l l y q u a n t i f i e d v a r i a b l e s . A graph r e p r e s e n t a t i o n of a con junc t i o n o f l i t e r a l s , c a l l e d a "p roduc t...
متن کاملThe Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
The Scholten/Dijkstra “Pebble Game” is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant. Technically this is achieved by exploiting the local and the reversible nature of Petri Net transitions. Furthermore, these properties allow to retain the verification arguments of the algorithm.
متن کاملA Hybrid Predicate Calculus∗
We present the Hybrid Predicate Calculus (HPC), a hybrid logical system which incorporates a fairly conventional first-order predicate calculus, but which also include elements of modal logic and relational algebra. A special effort has been made to produce a (syntactically and semantically) well-integrated whole, rather than just a disjoint union. Our calculus, from a formal point of view, is ...
متن کاملThe predicate calculus is complete∗
The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c, and we will use ∀vA(v) to denote the sentence that results from replacing all occurrences of c in A(c) with v and then putting the quantifier ∀v on the front. (We also require that the variable v did not already occur in A(c).) We use a similar c...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1998
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s002360050150